On the Computation of Recurrence Coefficients for Univariate Orthogonal Polynomials

نویسندگان

چکیده

Associated to a finite measure on the real line with moments are recurrence coefficients in three-term formula for orthogonal polynomials respect this measure. These frequently inputs modern computational tools that facilitate evaluation and manipulation of measure, such tasks foundational numerical approximation quadrature. Although classical measures known explicitly, those nonclassical must typically be numerically computed. We survey review existing approaches computing these univariate polynomial families propose novel “predictor–corrector” algorithm general class continuous measures. combine predictor–corrector scheme stabilized Lanczos procedure new hybrid computes fairly wide can have both discrete parts. evaluate algorithms against methods terms accuracy efficiency.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Discrete Painlevé equations for recurrence coefficients of orthogonal polynomials

The converse statement is also true and is known as the spectral theorem for orthogonal polynomials : if a family of polynomials satisfies a three-term recurrence relation of the form (1.2), with an > 0 and bn ∈ R and initial conditions p0 = 1 and p−1 = 0, then there exists a probability measure μ on the real line such that these polynomials are orthonormal polynomials satisfying (1.1). This gi...

متن کامل

Varying weights for orthogonal polynomials with monotonically varying recurrence coefficients

and the coefficients in (1.3), which depend on the parameter N , {an,N : bn,N}n=0, bn,N > 0. ∗The authors acknowledge support from NATO Collaborative linkage grant PST.CLG.979738 and INTAS Research Network 03-51-6637. The first author was supported by grants RFBR-05-01-00522, NSh1551.2003.1, Program No. 1 DMS RAS. The second author was supported by an NSF grant. The third author was supported b...

متن کامل

Ratio Asymptotics for Orthogonal Matrix Polynomials with Unbounded Recurrence Coefficients

In this work is presented a study on matrix biorthogonal polynomials sequences that satisfy a nonsymmetric recurrence relation with unbounded coefficients. The ratio asymptotic for this family of matrix biorthogonal polynomials is derived in quite general assumptions. It is considered some illustrative examples.

متن کامل

Computation of connection coefficients and measure modifications for orthogonal polynomials

We observe that polynomial measure modifications for families of univariate orthogonal polynomials imply sparse connection coefficient relations. We therefore propose connecting L2 expansion coefficients between a polynomial family and a modified family by a sparse transformation. Accuracy and conditioning of the connection and its inverse are explored. The connection and recurrence coefficient...

متن کامل

Relative Asymptotics for Orthogonal Matrix Polynomials with Convergent Recurrence Coefficients

The asymptotic behavior of #n (d;) #n (d:) and Pn (x, d;) P n (x, d:) is studied. Here (#n (.))n are the leading coefficients of the orthonormal matrix polynomials Pn (x, .) with respect to the matrix measures d; and d: which are related by d;(u)= d:(u)+ k=1 Mk$(u&ck), where Mk are positive definite matrices, $ is the Dirac measure and ck lies outside the support of d: for k=1, ..., N. Finally,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Scientific Computing

سال: 2021

ISSN: ['1573-7691', '0885-7474']

DOI: https://doi.org/10.1007/s10915-021-01586-w